On the Saddle-point Solution and the Large-Coalition Asymptotics of Fingerprinting Games

We study a fingerprinting game in which the number of colluders and the collusion channel are unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maximin games with mutual information as their payoff functions. However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here under the so-called Boneh-Shaw marking assumption, we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point solution. If the maximal coalition size is k and the fingerprinting alphabet is binary, we show that capacity decays quadratically with k. Furthermore, we prove rigorously that the asymptotic capacity is 1/(k^2 2ln2) and we confirm our earlier conjecture that Tardos' choice of the arcsine distribution asymptotically maximizes the mutual information payoff function while the interleaving attack minimizes it. Along with the asymptotic behavior, numerical solutions to the game for small k are also presented.Comment: submitted to IEEE Trans. on Information Forensics and Securit

Saddle-point Solution of the Fingerprinting Capacity Game Under the Marking Assumption

We study a fingerprinting game in which the collusion channel is unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maxmin games with mutual information as the payoff function. However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here under the so-called Boneh-Shaw marking assumption, we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point solution. If the maximal coalition size is $k$ and the fingerprint alphabet is binary, we derive equations that can numerically solve the capacity game for arbitrary $k$. We also provide tight upper and lower bounds on the capacity. Finally, we discuss the asymptotic behavior of the fingerprinting game for large $k$ and practical implementation issues.Comment: 5 pages, to appear in 2009 IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, June 200

Diagnosis and Treatment of Comorbidities of Tourette's Syndrome and Bipolar Disorder in A 10-Year-Old Boy

Changes in moods are one of the comorbid psychiatric manifestations that frequently occur in patients with Tourette's syndrome. The assessment of a manic episode in children with Tourette's syndrome is challenging. Furthermore, the treatment of children with comorbid mania and Tourette's syndrome has not been extensively studied. We present a 10-year-old boy who suffered from both Tourette's syndrome and mania, whose symptoms improved after using lithium and risperidone. The child was diagnosed with Tourette's syndrome at 7 years of age when he suffered from tics and experienced his first manic episode. He received monotherapy, including haloperidol, risperidone and aripiprazole, and the response was poor. When the combination of lithium and risperidone was used, the tics and mania subsided. It is important to assess individuals with Tourette's syndrome for associated bipolar disorder. The treatment of children with both disorders is a major clinical issue, and our case may serve as an example for successful treatment strategies

Reconstruction of human protein interolog network using evolutionary conserved network

<p>Abstract</p> <p>Background</p> <p>The recent increase in the use of high-throughput two-hybrid analysis has generated large quantities of data on protein interactions. Specifically, the availability of information about experimental protein-protein interactions and other protein features on the Internet enables human protein-protein interactions to be computationally predicted from co-evolution events (interolog). This study also considers other protein interaction features, including sub-cellular localization, tissue-specificity, the cell-cycle stage and domain-domain combination. Computational methods need to be developed to integrate these heterogeneous biological data to facilitate the maximum accuracy of the human protein interaction prediction.</p> <p>Results</p> <p>This study proposes a relative conservation score by finding maximal quasi-cliques in protein interaction networks, and considering other interaction features to formulate a scoring method. The scoring method can be adopted to discover which protein pairs are the most likely to interact among multiple protein pairs. The predicted human protein-protein interactions associated with confidence scores are derived from six eukaryotic organisms – rat, mouse, fly, worm, thale cress and baker's yeast.</p> <p>Conclusion</p> <p>Evaluation results of the proposed method using functional keyword and Gene Ontology (GO) annotations indicate that some confidence is justified in the accuracy of the predicted interactions. Comparisons among existing methods also reveal that the proposed method predicts human protein-protein interactions more accurately than other interolog-based methods.</p

THE KINETIC ANALYSIS OF CONTINUOUS JUMP WITH BENT LEGS

The purpose of this study was to investigate the effects of fatigue on lower extremity dynamics during 60s continuous jump with bent legs (CJBL). Twelve college students served as subjects in this study. A Kistler force plate (500Hz) was used to collect vertical ground reaction force. Dependent t-test was used to test the difference between prefatigue and post-fatigue (a = .05). There were significantly differences on instantaneous force, peak force before take-off phase, and average concentric power between prefatigue and post-fatigue during CJBL (